Calculation of control coefficients of metabolic pathways. A flux-oriented graph-theoretic approach
نویسندگان
چکیده
منابع مشابه
A flux-oriented graph-theoretic approach
Within the premises of the flux-oriented theory of Crabtree & Newsholme [(1987) Biochem. J. 247, 113-120], I have used a graph-theoretic approach for calculating the Control Coefficients of metabolic pathways. It is shown that a directed graph representing the control structure of a metabolic pathway can be constructed in a heuristic manner directly from the reaction diagram of the pathway, wit...
متن کاملthe impact of portfolio assessment on iranian efl students essay writing: a process-oriented approach
this study was conducted to investigate the impact of portfolio assessment as a process-oriented assessment mechanism on iranian efl students’ english writing and its subskills of focus, elaboration, organization, conventions, and vocabulary. out of ninety juniors majoring in english literature and translation at the university of isfahan, sixty one of them who were at the same level of writing...
15 صفحه اولGraph-theoretic Approach for Identifying Catalytic or Metabolic Pathways
Stoichiometrically exact and potentially feasible catalytic or metabolic pathways can be found by synthesizing the networks of plausible elementary or metabolic reactions constituting such pathways, respectively. The current contribution presents a mathematically exact algorithmic approach for carrying out the necessary synthesis, which is profoundly complex combinatorially. The approach is bas...
متن کاملA theoretic control approach in signal-controlled metabolic pathways.
Cells use a signal transduction mechanism to regulate certain metabolic pathways. In this paper, the regulatory mechanism is analyzed mathematically. For this analysis, a mathematical model for the pathways is first established using a system of differential equations. Then the linear stability, controllability, and observability of the system are investigated. We show that the linearized syste...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Biochemical Journal
سال: 1991
ISSN: 0264-6021,1470-8728
DOI: 10.1042/bj2790055